Performance Analysis of Public key Cryptographic Systems RSA and NTRU

In many business sectors secure and efficient data transfer is essential. To ensure the security to the applications of business, the business sectors use Public Key Cryptographic Systems (PKCS). An RSA and NTRU system generally belongs to the category of PKCS. The efficiency of a public key cryptographic system is mainly measured in computational overheads, key size and bandwidth. In particular, the RSA algorithm is used in many applications. Although the security of RSA is beyond doubt, the evolution in computing power has caused a growth in the necessary key length. The fact that most chips on smart cards cannot process keys extending 1024 bit shows that there is a need for alternative. NTRU is such an alternative and it is a collection of mathematical algorithms based on manipulating lists of very small integers and polynomials. This allows NTRU to achieve high speeds with the use of minimal computing power. NTRU is the first secure public key cryptosystem not based on factorization or discrete logarithm problems. This means that given sufficient computational resources and time, an adversary, should not be able to break the key. The performance characteristics of NTRU and RSA are observed by implementing the algorithms for computation and comparing their experimental running times. Encryption and decryption speeds take O (n log (n)) operations. The RSA’s complexity is O (n ) operations and it compares with NTRU’s O (n log(n) operations. In this paper, we proposed and presented these two well known Public Key Cryptographic Systems, and were implemented to verify their performance for different text files of variable sizes.